/**
 * Created with IntelliJ IDEA.
 * Description:最小花费爬楼梯
 * User: wangxin
 * Date: 2024-12-30
 * Time: 21:26
 */
public class Test1 {
    public int minCostClimbingStairs (int[] cost) {
        // write code here
        int n = cost.length;
        int[] dp = new int [n+1];
        for(int i = 2;i <= n;i++){
            dp[i] = Math.min(cost[i-1]+dp[i-1],cost[i-2]+dp[i-2]);
        }
        return dp[n];
    }
}
